package com.lyz.dataStructure.algorithm.转转2020;/**
 * @Author:759057893@qq.com Lyz
 * @Date: ${Date} 21:13
 * @Description:
 **/

import java.util.Scanner;

/**
 *@Author:759057893@qq.com Lyz
 *@Date: 2019/9/16 21:13
 *@Description:
 **/
public class 最长连续递增序列 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] arr = new int[n];
        for(int i = 0;i<arr.length;i++){
            arr[i] = sc.nextInt();
        }
        System.out.println();
    }

    public static int findLength(int[] nums){
        return 0;
    }

    public static int findLengthOf(int[] nums){
        if(nums.length==0||nums==null) return 0;
        int count = 1;
        int pre = nums[0];
        int res = 0;
        for(int i =1;i<nums.length;i++){
            if(nums[i]>pre){
                count++;
                pre =nums[i];
            }else {
                if(count>res){
                    res = count;
                }
                count =1;
                pre = nums[i];
            }
        }
        if(res<count){
            res = count;
        }
        return res;
    }
}
